Graphs and Separability Properties of Groups

نویسندگان

  • Rita Gitik
  • RITA GITIK
چکیده

Ž . A group G is LERF locally extended residually finite if for any finitely generated subgroup S of G and for any g f S there exists a finite index subgroup S of G which contains S but not g. Using graph-theoretical methods we give 0 algorithms for constructing finite index subgroups in amalgamated free products of groups with good separability properties. We prove that a free product of a free group and a LERF group amalgamated over a cyclic subgroup maximal in the free factor is LERF. The maximality condition cannot be removed, because adjunction of roots does not preserve property LERF. We also give short proofs of some old theorems about separability properties of groups, including a theorem of Brunner, Burns, and Solitar that a free product of free groups amalgamated over a cyclic subgroup is LERF. Q 1997 Academic Press

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Lattice of Integral Flows and the Latticeof Integral Coboundaries on a Finite

The set of integral ows on a nite graph ? is naturally an integral lattice 1 (?) in the Euclidean space Ker((1) of harmonic real-valued functions on the edge set of ?. Various properties of ? (bipartite character, girth, complexity, separability) are shown to correspond to properties of 1 (?) (parity, minimal norm, determinant, decomposability). The dual lattice of 1 (?) is identiied to the int...

متن کامل

Separability of Density Matrices of Graphs for Multipartite Systems

We investigate separability of Laplacian matrices of graphs when seen as density matrices. This is a family of quantum states with many combinatorial properties. We firstly show that the well-known matrix realignment criterion can be used to test separability of this type of quantum states. The criterion can be interpreted as novel graph-theoretic idea. Then, we prove that the density matrix of...

متن کامل

The Lattice of Integral Flows and Thelattice of Integral Cuts on a Finite

The set of integral ows on a nite graph ? is naturally an integral lattice 1 (?) in the Euclidean space Ker((1) of harmonic real-valued functions on the edge set of ?. Various properties of ? (bipartite character, girth, complexity, separability) are shown to correspond to properties of 1 (?) (parity, minimal norm, determinant, decomposability). The dual lattice of 1 (?) is identiied to the int...

متن کامل

Path Separability of Graphs

In this paper we investigate the structural properties of k-path separable graphs, that are the graphs that can be separated by a set of k shortest paths. We identify several graph families having such path separability, and we show that this property is closed under minor taking. In particular we establish a list of forbidden minors for 1-path separable graphs.

متن کامل

On graphs whose Laplacian matrix's multipartite separability is invariant under graph isomorphism

Normalized Laplacian matrices of graphs have recently been studied in the context of quantum mechanics as density matrices of quantum systems. Of particular interest is the relationship between quantum physical properties of the density matrix and the graph theoretical properties of the underlying graph. One important aspect of density matrices is their entanglement properties, which are respon...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997